A family of polycyclic groups over which the uniform conjugacy problem is NP-complete
نویسندگان
چکیده
In this paper we study the conjugacy problem in polycyclic groups. Our main result is that we create polycyclic groups Gn whose conjugacy problem is at least as hard as the subset sum problem with n indeterminates. As such, the conjugacy problem over the groups Gn is NP-complete where the parameters of the problem are taken in terms of n and the length of the elements given on input.
منابع مشابه
A Logspace Solution to the Word and Conjugacy problem of Generalized Baumslag-Solitar Groups
Baumslag-Solitar groups were introduced in 1962 by Baumslag and Solitar as examples for finitely presented non-Hopfian two-generator groups. Since then, they served as examples for a wide range of purposes. As Baumslag-Solitar groups are HNN extensions, there is a natural generalization in terms of graph of groups. Concerning algorithmic aspects of generalized Baumslag-Solitar groups, several d...
متن کاملDecidability and Independence of Conjugacy Problems in Finitely Presented Monoids
There have been several attempts to extend the notion of conjugacy from groups to monoids. The aim of this paper is study the decidability and independence of conjugacy problems for three of these notions (which we will denote by ∼p, ∼o, and ∼c) in certain classes of finitely presented monoids. We will show that in the class of polycyclic monoids, p-conjugacy is “almost” transitive, ∼c is stric...
متن کاملPolycyclic Groups: a New Platform for Cryptology?
We propose a new cryptosystem based on polycyclic groups. The cryptosystem is based on the fact that the word problem can be solved effectively in polycyclic groups, while the known solutions to the conjugacy problem are far less efficient.
متن کاملThe Post correspondence problem in groups
We generalize the classical Post correspondence problem (PCPn) and its non-homogeneous variation (GPCPn) to non-commutative groups and study the computational complexity of these new problems. We observe that PCPn is closely related to the equalizer problem in groups, while GPCPn is connected to the double twisted conjugacy problem for endomorphisms. Furthermore, it is shown that one of the str...
متن کاملZero-Knowledge Proofs of the Conjugacy for Permutation Groups
We design a perfect zero-knowledge proof system for recognition if two permutation groups are conjugate. It follows, answering a question posed by O. G. Ganyushkin, that this recognition problem is not NP-complete unless the polynomial-time hierarchy collapses.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJAC
دوره 24 شماره
صفحات -
تاریخ انتشار 2014